Bisimulation as a logical relation
نویسندگان
چکیده
Abstract We investigate how various forms of bisimulation can be characterised using the technology logical relations. The approach taken is that each form corresponds to an algebraic structure derived from a transition system, and general result relation R between two systems on state spaces S T if only structures are in automatically generated . show this works for original Park–Milner it extends weak bisimulation, branching semi-branching bisimulation. paper concludes with discussion probabilistic where situation slightly more complex, partly owing need encompass bisimulations not just
منابع مشابه
On Coupled Logical Bisimulation
We study coupled logical bisimulation (CLB) to reason about contextual equivalence in the λcalculus. CLB originates in a work by Dal Lago, Sangiorgi and Alberti, as a tool to reason about a λ-calculus with probabilistic constructs. We adapt the original definition to the pure λ-calculus. We develop the metatheory of CLB in call-by-name and in call-by-value, and draw comparisons with applicative...
متن کاملLogical Characterization of Bisimulation Metrics
Bisimulation metrics provide a robust and accurate approach to study the behavior of nondeterministic probabilistic processes. In this paper, we propose a logical characterization of bisimulation metrics based on a simple probabilistic variant of the Hennessy-Milner logic. Our approach is based on the novel notions of mimicking formulae and distance between formulae. The former are a weak versi...
متن کاملUnprovability of the Logical Characterization of Bisimulation
We quickly review labelled Markov processes (LMP) and provide a counterexample showing that in general measurable spaces, event bisimilarity and state bisimilarity differ in LMP. This shows that the logic in Desharnais [3] does not characterize state bisimulation in non-analytic measurable spaces. Furthermore we show that, under current foundations of Mathematics, such logical characterization ...
متن کاملLogical characterization of probabilistic τ -bisimulation equivalences
Stochastic Petri nets (SPNs) is a well-known model for quantitative analysis. We consider the class called DTWSPNs that is a modification of discrete time SPNs (DTSPNs) by transition labeling and weights. Transitions of DTWSPNs are labeled by actions that represent elementary activities and can be visible or invisible for an external observer. For DTWSPNs, interleaving and step probabilistic τ ...
متن کاملA Concurrent Logical Relation
We present a logical relation for showing the correctness of program transformations based on a new type-and-effect system for a concurrent extension of an ML-like language with higher-order functions, higher-order store and dynamic memory allocation. We show how to use our model to verify a number of interesting program transformations that rely on effect annotations. In particular, we prove a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Structures in Computer Science
سال: 2022
ISSN: ['1469-8072', '0960-1295']
DOI: https://doi.org/10.1017/s0960129522000020